PARALLEL TEMPERING FOR THE TRAVELING SALESMAN PROBLEM
نویسندگان
چکیده
منابع مشابه
An Approach for Solving Traveling Salesman Problem
In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...
متن کاملParallel Evolutionary Algorithm for the Traveling Salesman Problem
In this paper we present a evolutionary algorithm for solving traveling salesman problem (TSP). It deals with testing feasible solutions which are local minima. This method is based on the following observation: if there are the same elements in some positions in several permutations, which are local minima, then these elements are in the same position in the optimal solution. Computational exp...
متن کاملParallel Ant Colony Optimization for the Traveling Salesman Problem
There are two reasons for parallelizing a metaheuristic if one is interested in performance: (i) given a fixed time to search, the aim is to increase the quality of the solutions found in that time; (ii) given a fixed solution quality, the aim is to reduce the time needed to find a solution not worse than that quality. In this article, we study the impact of communication when we parallelize a ...
متن کاملMassively Parallel Approximation Algorithms for the Traveling Salesman Problem
The traveling salesman problem (TSP) describes a salesman who needs to travel through a list of given cities exactly once by taking the shortest possible tour. The problem is NP-Complete since there are no known polynomial time algorithms to solve it. The main motivation to solve this problem is that the applications of Traveling Salesman are immense. It can be used by banks to find an optimal ...
متن کاملNew parallel randomized algorithms for the traveling salesman problem
We recently developed a new randomized optimization framework, the Nested Partitions (NP) method. This approach uses partitioning, random sampling, promising index, and backtracking to create a Markov chain that has global optima as its absorbing states. This new method combines global search and local search (heuristic) procedures in a nature way and it is highly matched to emerging massively ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Physics C
سال: 2009
ISSN: 0129-1831,1793-6586
DOI: 10.1142/s0129183109013893